home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
ftp.cs.arizona.edu
/
ftp.cs.arizona.edu.tar
/
ftp.cs.arizona.edu
/
icon
/
newsgrp
/
group98a.txt
/
000143_icon-group-sender _Tue Mar 17 12:27:55 1998.msg
< prev
next >
Wrap
Internet Message Format
|
2000-09-20
|
2KB
Return-Path: <icon-group-sender>
Received: from kingfisher.CS.Arizona.EDU (kingfisher.CS.Arizona.EDU [192.12.69.239])
by baskerville.CS.Arizona.EDU (8.8.7/8.8.7) with SMTP id MAA17272
for <icon-group-addresses@baskerville.CS.Arizona.EDU>; Tue, 17 Mar 1998 12:27:55 -0700 (MST)
Received: by kingfisher.CS.Arizona.EDU (5.65v4.0/1.1.8.2/08Nov94-0446PM)
id AA21249; Tue, 17 Mar 1998 12:27:55 -0700
Message-Id: <350EA1D5.26BB@gte.net>
Date: Tue, 17 Mar 1998 10:16:21 -0600
From: Mark Evans <evans@gte.net>
Reply-To: evans@gte.net
Organization: None
X-Mailer: Mozilla 3.01 (Win95; I)
Mime-Version: 1.0
To: icon-group@optima.CS.Arizona.EDU
Subject: Re: Letter Probabilities
References: <9803162346.AA0130@valinet.com>
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Errors-To: icon-group-errors@optima.CS.Arizona.EDU
Status: RO
Content-Length: 607
I think that we have here one of those classic execution-time vs.
memory-space tradeoffs that they teach about in computer science
classes.
Mark
Paul Abrahams wrote:
>
> Using the probabilities to construct a weighted string and then
> selecting a random character from the string does have one unaesthetic
> property, in my book: the length of the string grows exponentially with
> the precision of the probabilities. For that reason I'd opt for a
> binary search, which takes 5 probes no matter what the precision.
>
> I wonder if there's another way of attacking this problem.
>
> Paul Abrahams